Recovering Empty Arguments in Korean
نویسندگان
چکیده
This paper looks at empty arguments in Korean, and the constraints that can be used in recovering their meaning, or referent. We look at scrambling to provide insights into the process by which empty arguments can be recovered, and provide a computational algorithm based on local and global information that takes advantage of the semantic restrictions placed by the verb. We look at recovering empty arguments at both the sentential and dialog levels.
منابع مشابه
Korean Grammar Using TAGs
This paper addresses various issues related to representing the Korean language using Tree Ad joining Grammars Topics covered include Korean grammar using TAGs Machine Translation between Korean and English using Synchronous Tree Adjoining Grammars STAGs handling scrambling using Multi Component TAGs MC TAGs and recovering empty arguments The data for the parsing is from US military telecommuni...
متن کاملHandling Structural Divergences and Recovering Dropped Arguments in a Korean/english Machine Translation System ?
This paper describes an approach for handling structural divergences and recovering dropped arguments in an implemented Korean to English machine translation system. The approach relies on canonical predicate-argument structures (or dependency structures), which provide a suitable pivot representation for the handling of structural divergences and the recovery of dropped arguments. It can also ...
متن کاملHandling Stuctural Divergences and Recovering Dropped Arguments in a Korean/English Machine Translation System
This paper describes an approach for handling structural divergences and recovering dropped arguments in an implemented Korean to English machine translation system. The approach relies on canonical predicate-argument structures (or dependency structures), which provide a suitable pivot representation for the handling of structural divergences and the recovery of dropped arguments. It can also ...
متن کاملChasing the ghost: recovering empty categories in the Chinese Treebank
Empty categories represent an important source of information in syntactic parses annotated in the generative linguistic tradition, but empty category recovery has only started to receive serious attention until very recently, after substantial progress in statistical parsing. This paper describes a unified framework in recovering empty categories in the Chinese Treebank. Our results show that ...
متن کاملA Simple Pattern-matching Algorithm for Recovering Empty Nodes and their Antecedents
This paper describes a simple patternmatching algorithm for recovering empty nodes and identifying their co-indexed antecedents in phrase structure trees that do not contain this information. The patterns are minimal connected tree fragments containing an empty node and all other nodes co-indexed with it. This paper also proposes an evaluation procedure for empty node recovery procedures which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006